package lanQiaoBei.数学知识.卡特兰组合数;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Scanner;

//https://blog.csdn.net/Jacob0824/article/details/122771737  C[2n][n]/(n+1)
public class P1 {
       static BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
       static int n,mod=(int)1e9+7;
       
       static int qmi(int a,int k){
    	   int res=1;
 	       while(k>0){
 	    	  if((k&1)==1)res=(int)(1L*res*a%mod);
 	    	  k>>=1;
 	    	  a=(int)(1L*a*a%mod);
 	      }
 	      return res;
       }
       public static void main(String[] args) throws IOException {
		      n=Integer.parseInt(br.readLine());
		      
		      int res=1;
		      for(int i=2*n,j=1;i>n;i--,j++){
		    	  res=(int)(1L*res*i%mod);
		    	  res=(int)(1L*res*qmi(j,mod-2)%mod);
		      }
		      res=(int)(1L*res*qmi(n+1,mod-2)%mod);
		      System.out.print(res);
	}
}
